A linearly convergent algorithm for sparse signal reconstruction
نویسندگان
چکیده
منابع مشابه
A Linearly-Convergent Stochastic L-BFGS Algorithm
We propose a new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic variant of L-BFGS proposed in Byrd et al. (2014) as well as a recent approach to variance reduction for stochastic gradient descent from Johnson and Zhang (2013). We demonstrate experimentally that our algorithm performs ...
متن کاملA Distributed Sparse Signal Reconstruction Algorithm in Wireless Sensor Network
We address the sparse signal reconstruction problem over networked sensing system. Signal acquisition is performed as in compressive sensing (CS), hence the number of measurements is reduced. Majority of existing algorithms are developed based on p minimization in the framework of distributed convex optimization and thus whose performance is sensitive to the tuning of additional parameters. In ...
متن کاملA heuristic for sparse signal reconstruction
Compressive Sampling (CS) is a new method of signal acquisition and reconstruction from frequency data which do not follow the basic principle of the Nyquist-Shannon sampling theory. This new method allows reconstruction of the signal from substantially fewer measurements than those required by conventional sampling methods. We present and discuss a new, swarm based, technique for representing ...
متن کاملOn a Gradient-Based Algorithm for Sparse Signal Reconstruction in the Signal/Measurements Domain
Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common compressive sensing methods the signal is recovered in the sparsity domain. A method for the reconstruction of sparse signals that reconstructs the missing/unavailable samples/measurements is recently proposed. This method can be efficiently used in signal processing applications whe...
متن کاملA Convergent Incoherent Dictionary Learning Algorithm for Sparse Coding
Recently, sparse coding has been widely used in many applications ranging from image recovery to pattern recognition. The low mutual coherence of a dictionary is an important property that ensures the optimality of the sparse code generated from this dictionary. Indeed, most existing dictionary learning methods for sparse coding either implicitly or explicitly tried to learn an incoherent dicti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fixed Point Theory and Applications
سال: 2018
ISSN: 1661-7738,1661-7746
DOI: 10.1007/s11784-018-0635-1